Knotty-Centrality: Finding the Connective Core of a Complex Network

نویسندگان

  • Murray Shanahan
  • Mark Wildie
چکیده

A network measure called knotty-centrality is defined that quantifies the extent to which a given subset of a graph's nodes constitutes a densely intra-connected topologically central connective core. Using this measure, the knotty centre of a network is defined as a sub-graph with maximal knotty-centrality. A heuristic algorithm for finding subsets of a network with high knotty-centrality is presented, and this is applied to previously published brain structural connectivity data for the cat and the human, as well as to a number of other networks. The cognitive implications of possessing a connective core with high knotty-centrality are briefly discussed.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications

A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...

متن کامل

Sectoral Growth and Centrality in Stock Market in Iran: Application of Complex Network Analysis

Stock price and its changes which reflect the individuals’ investment decisions in economic environment are the most important factors in evaluating the economic value of a company in stock market. Stock price changes are not independent of each other. Therefore, study of the correlation between stock price changes provides a better understanding of market performance for investors. Analysis of...

متن کامل

The Application of Complex Networks Analysis to Assess Iran's Trade and It's Most Important Trading Partners in Asia

The existing trade models suggest that for tradable goods potential partners can be many, but eventually only one (the one offering the best price) should be selected, therefore relatively few (unidirectional) trade links will appear between countries. If the structure of international trade flows describes as a network, trade link would give rise between countries. This paper exploit recently-...

متن کامل

finding influential individual in Social Network graphs using CSCS algorithm and shapley value in game theory

In recent years, the social networks analysis gains great deal of attention. Social networks have various applications in different areas namely predicting disease epidemic, search engines and viral advertisements. A key property of social networks is that interpersonal relationships can influence the decisions that they make. Finding the most influential nodes is important in social networks b...

متن کامل

Centrality metrics and localization in core-periphery networks

Two concepts of centrality have been defined in complex networks. The first considers the centrality of a node and many different metrics for it has been defined (e.g. eigenvector centrality, PageRank, non-backtracking centrality, etc). The second is related to a large scale organization of the network, the core-periphery structure, composed by a dense core plus an outlying and loosely-connecte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2012